Digit sums and generating functions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating functions and generalized Dedekind sums

We study sums of the form ∑ ζ R(ζ), where R is a rational function and the sum is over all nth roots of unity ζ (often with ζ = 1 excluded). We call these generalized Dedekind sums, since the most well-known sums of this form are Dedekind sums. We discuss three methods for evaluating such sums: The method of factorization applies if we have an explicit formula for ∏ ζ(1− xR(ζ)). Multisection ca...

متن کامل

On composition of generating functions

In this work we study numbers and polynomials generated by two type of composition of generating functions and get their explicit formulae. Furthermore we state an improvementof the composita formulae's given in [6] and [3], using the new composita formula's we construct a variety of combinatorics identities. This study go alone to dene new family of generalized Bernoulli polynomials which incl...

متن کامل

Tutte polynomials of wheels via generating functions

We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.

متن کامل

Probability Generating Functions for Sattolo’s Algorithm

In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...

متن کامل

Generating Functions, Weighted and Non-Weighted Sums for Powers of Second-Order Recurrence Sequences

In this paper we find closed forms of the generating function ∞ ∑ k=0 U r nx , for powers of any non-degenerate second-order recurrence sequence, Un+1 = aUn+bUn−1, a +4b 6= 0, completing a study began by Carlitz [1] and Riordan [4] in 1962. Moreover, we generalize a theorem of Horadam [3] on partial sums involving such sequences. Also, we find closed forms for weighted (by binomial coefficients...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Ramanujan Journal

سال: 2020

ISSN: 1382-4090,1572-9303

DOI: 10.1007/s11139-019-00193-6